منابع مشابه
Soft arc consistency revisited
Article history: Received 31 January 2009 Received in revised form 25 January 2010 Accepted 28 January 2010 Available online 2 February 2010
متن کاملArc Consistency Revisited
In this paper, we propose a new arc consistency algorithm, AC-8, which requires less computation time and space than AC6 and AC-7 proposed by Bessière et al. (1994, 1995). The main idea of the optimization is the divide-and-conquer strategy, thereby decomposing an arc consistency problem into a series of smaller ones and trying to solve them in sequence. In this way, not only the space complexi...
متن کاملOptimal Soft Arc Consistency
The Valued (VCSP) framework is a generic optimization framework with a wide range of applications. Soft arc consistency operations transform a VCSP into an equivalent problem by shifting weights between cost functions. The principal aim is to produce a good lower bound on the cost of solutions, an essential ingredient of a branch and bound search. But soft AC is much more complex than tradition...
متن کاملArc and Path Consistency Revisited
ARC AND PATH CONSISTENCY REVISITED' Roger Mohr and Thomas C. Henderson 2 CRIN BP 239 54506 Vandoeuvre (France)
متن کاملArc Consistency for Soft Constraints
The notion of arc consistency plays a central role in constraint satisfaction. It is known since [19, 4, 5] that the notion of local consistency can be extended to constraint optimisation problems defined by soft constraint frameworks based on an idempotent cost combination operator. This excludes non idempotent operators such as + which define problems which are very important in practical app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2010
ISSN: 0004-3702
DOI: 10.1016/j.artint.2010.02.001